On Combinations of Binary Qualitative Constraint Calculi
نویسندگان
چکیده
Qualitative constraint calculi are representation formalisms that allow for efficient reasoning about spatial and temporal information. Many of the calculi discussed in the field of Qualitative Spatial and Temporal Reasoning can be defined as combinations of other, simpler and more compact formalisms. On the other hand, existing calculi can be combined to a new formalism in which one can represent, and reason about, different aspects of a domain at the same time. For example, Gerevini and Renz presented a loose combination of the region connection calculus RCC-8 and the point algebra: the resulting formalism integrates topological and qualitative size relations between spatially extended objects. In this paper we compare the approach by Gerevini and Renz to a method that generates a new qualitative calculus by exploiting the semantic interdependencies between the component calculi. We will compare these two methods and analyze some formal relationships between a combined calculus and its components. The paper is completed by an empirical case study in which the reasoning performance of the suggested methods is compared on random test instances.
منابع مشابه
GQR – A Fast Reasoner for Binary Qualitative Constraint Calculi
GQR (Generic Qualitative Reasoner) is a solver for binary qualitative constraint networks. GQR takes a calculus description and one or more constraint networks as input, and tries to solve the networks using the path consistency method and (heuristic) backtracking. In contrast to specialized reasoners, it offers reasoning services for different qualitative calculi, which means that these calcul...
متن کاملGQR: A Fast Solver for Binary Qualitative Constraint Networks
Qualitative calculi are constraint-based representation formalisms that allow for efficient reasoning about continuous aspects of the world with inherently infinite domains, such as time and space. GQR (Generic Qualitative Reasoner) is a tool that provides reasoning services for arbitrary binary qualitative calculi. Given qualitative information expressible in a qualitative calculus, GQR checks...
متن کاملFormal Properties of Constraint Calculi for Qualitative Spatial Reasoning
In the previous two decades, a number of qualitative constraint calculi have been developed, which are used to represent and reason about spatial configurations. A common property of almost all of these calculi is that reasoning in them can be understood as solving a binary constraint satisfaction problem over infinite domains. The main algorithmic method that is used is constraint propagation ...
متن کاملAn Efficient Algorithm for Generating Composition Tables for Qualitative Spatial Relations
Qualitative Spatial Reasoning (QSR) is useful for deriving logical inferences when quantitative spatial information is not pertinent or not available. The automated derivation of such logical inferences becomes a binary constraint satisfaction problem; binary relations can be formulated as a region-based qualitative reasoning problem involving disjunctive constraints. It has been proved [1] tha...
متن کامل9+-Intersection Calculi for Topological Reasoning on Heterogeneous Objects
This paper develops a series of qualitative spatial calculi that feature topological relations. While most qualitative spatial calculi have targeted spatial relations between single-type objects, our calculi support spatial relations between heterogeneous combinations of objects. Thus, with our calculi, we can disambiguate topological arrangements of objects without regard to the types of the o...
متن کامل